Symmetric Item Set Mining Method Using Zero-suppressed BDDs and Application to Biological Data
نویسندگان
چکیده
منابع مشابه
Symmetric Item Set Mining Using Zero-suppressed BDDs
(Abstract) In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory of Boolean functions, and there have been developed fast symmetry checking methods based on BDDs (Binary Decision Diagrams). Here we discuss the property of symmetric items in data mining problems, and des...
متن کاملSymmetric Item Set Mining Method Using ZBDDs and Application to Biological Data
(Abstract) In this paper, we present a method of finding symmetric items in a combinatorial item set database. The techniques for finding symmetric variables in Boolean functions have been studied for long time in the area of VLSI logic design, and the BDD (Binary Decision Diagram)-based methods are presented to solve such a problem. Recently , we have developed an efficient method for handling...
متن کاملGenerating Frequent Closed Item Sets Based on Zero-suppressed BDDs
(Abstract) Frequent item set mining is one of the fundamental techniques for knowledge discovery and data mining. In the last decade, a number of efficient algorithms for frequent item set mining have been presented, but most of them focused on just enumerating the item set patterns which satisfy the given conditions, and it was a different matter how to store and index the result of patterns f...
متن کاملUnordered N-gram Representation Based on Zero-suppressed BDDs for Text Mining and Classification
In this paper, we present a new method to analyze unordered n-grams by using ZBDDs (Zero-suppressed BDDs). n-grams have been used not only for text analysis but also for text indexing in some search engines. We newly use a variation of n-grams called unordered n-grams. Unordered n-grams abstract from the position of the characters in each n-gram, i.e., they just deal with the range of ordinary ...
متن کاملN-Gram Analysis Based on Zero-Suppressed BDDs
In present paper, we propose a new method of n-gram analysis using ZBDDs (Zero-suppressed BDDs). ZBDDs are known as a compact representation of combinatorial item sets. Here, we newly apply the ZBDD-based techniques for efficiently handling sets of sequences. Using the algebraic operations defined over ZBDDs, such as union, intersection, difference, etc., we can execute various processings and/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2007
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.22.156